The Independence Number for De Bruijn networks and Kautz networks
نویسندگان
چکیده
منابع مشابه
De Bruijn and Kautz bus networks
Our aim is to nd bus interconnection networks which connect as many processors as possible, for given upper bounds on the number of connections per processor, the number of processors per bus and the network diameter. Point-to-point networks are a special case of bus networks in which every bus connects only two processors. In this case de Bruijn and Kautz networks and their generalizations are...
متن کاملNeighborhood Broadcasting in Undirected de Bruijn and Kautz Networks
This paper considers a neighborhood broadcasting protocol in undirected de Bruijn and Kautz networks. The neighborhood broadcasting problem(NBP) is the problem of disseminating a message from an originator vertex to only its neighbors. Our protocol works under the single-port and half-duplex model and solves NBP in 5 log2(n + 1) + O(1) time units on the undirected de Bruijn graph UB(n, d) with ...
متن کاملBisecting de Bruijn and Kautz Graphs
De Bruijn and Kautz graphs have been intensively studied as perspective interconnection networks of massively parallel computers. One of the crucial parameters of an interconnection network is its bisection width. It has innuence on both communication properties of the network and the algorithmic design. We prove optimal bounds on the edge and vertex bisection widths of the k-ary n-dimensional ...
متن کاملSelf-Stabilizing De Bruijn Networks
This paper presents a dynamic overlay network based on the De Bruijn graph which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage that it has a guaranteed constant node degree and that the routing between any two nodes takes at most O(logn) hops with high probability. Also, we show that there is a simple local-control algorithm that can recover the LDB network from ...
متن کاملWormhole routing in de Bruijn networks and hyper-de Bruijn networks
The order-(m, n) hyper-deBruijn graph HD(m,n) is the direct product of an order-m hypercube and an order-n debruijn graph. The hyper-deBruijn graph offers flexibility in terms of connections per node and the level of fault-tolerance. These networks as well possess logarithmic diameter, simple routing algorithms and support many computationally important subgraphs and admit efficient implementat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.01.009